A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength
نویسندگان
چکیده
A Covering Array denoted by CA(N ; t, k, v) is a matrix of size N × k, in which each of the v combinations appears at least once in every t columns. Covering Arrays (CAs) are combinatorial objects used in software testing. There are different methods to construct CAs, but as it is a highly combinatorial problem, few complete algorithms to construct CAs have been reported. In this paper a new backtracking algorithm based on the Branch & Bound technique is presented. It searches only non-isomorphic Covering Arrays to reduce the search space of the problem of constructing them. The results obtained with this algorithm are able to match some of the best known solutions for small instances of binary CAs.
منابع مشابه
Using the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کاملProfiles of covering arrays of strength two
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...
متن کاملGenerating Combinatorial Test Suite with Solution Space Tree for Configurations Testing of Sensors Networks
There are many results about generating pair-wise covering arrays with strength τ=2 have been reported, but fewer results are published for high-strength covering arrays with a higher-strength τ>2. In configuration testing of sensor networks, high-strength covering array is required to construct combinatorial test cases. To generate combinatorial test suite with higher-strength, a backtracking ...
متن کاملConstructing strength three covering arrays with augmented annealing
A covering array CA(N ; t, k, v) is an N × k array such that every N × t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. One application of these objects is to generate software test suites to cover all t-sets of component interactions. Methods for construction of covering arrays for software testing have focused on two main areas. The first i...
متن کاملNew bounds for binary covering arrays using simulated annealing
Covering arrays (CAs) are combinatorial structures specified as a matrix of N rows and k columns over an alphabet on v symbols such that for each set of t columns (called the strength of the array) every t-tuple of symbols is covered. Recently they have been used to represent interaction test suites for software testing given that they provide economical sized test cases while still preserving ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009